Computing the log-determinant of symmetric, diagonally dominant matrices in near-linear time
نویسندگان
چکیده
We present new algorithms for computing the log-determinant of symmetric, diagonally dominant matrices. Existing algorithms run with cubic complexity with respect to the size of the matrix in the worst case. Our algorithm computes an approximation of the log-determinant in time near-linear with respect to the number of non-zero entries and with high probability. This algorithm builds upon the utra-sparsifiers introduced by Spielman and Teng for Laplacian matrices and ultimately uses their refined versions introduced by Koutis, Miller and Peng in the context of solving linear systems. We also present simpler algorithms that compute upper and lower bounds and that may be of more immediate practical interest.
منابع مشابه
A Nearly-Linear Time Algorithm for Approximately Solving Linear Systems in a Symmetric M-Matrix
We present an algorithm for solving a linear system in a symmetric M-matrix. In particular, for n × n symmetric M-matrix M , we show how to find a diagonal matrix D such that DMD is diagonallydominant. To compute D, the algorithm must solve O (log n) linear systems in diagonally-dominant matrices. If we solve these diagonallydominant systems approximately using the Spielman-Teng nearly-linear t...
متن کاملSparsified Cholesky Solvers for SDD linear systems
We show that Laplacian and symmetric diagonally dominant (SDD) matrices can be well approximated by linear-sized sparse Cholesky factorizations. Specifically, n × n matrices of these types have constant-factor approximations of the form LL , where L is a lowertriangular matrix with O(n) non-zero entries. This factorization allows us to solve linear systems in such matrices in O(n) work and O(lo...
متن کاملInverses of symmetric, diagonally dominant positive matrices and applications
We prove tight bounds for the ∞-norm of the inverse of a symmetric, diagonally dominant positive matrix J ; in particular, we show that ‖J‖∞ is uniquely maximized among all such J . We also prove a new lower-bound form of Hadamard’s inequality for the determinant of diagonally dominant positive matrices and an improved upper bound for diagonally balanced positive matrices. Applications of our r...
متن کامل2 00 3 Nearly - Linear Time Algorithms for Graph Partitioning , Graph Sparsification , and Solving Linear Systems third draft Daniel
We develop nearly-linear time algorithms for approximately solving sparse symmetric diagonally-dominant linear systems. In particular, we present a linear-system solver that, given an n-by-n symmetric diagonally-dominant matrix A with m non-zero entries and an n-vector b, produces a vector x̃ within relative distance ǫ of the solution to Ax = b in time m ( log n+ log(nκf (A)/ǫ) ) +min ( m,n log ...
متن کامل2 00 3 Nearly - Linear Time Algorithms for Graph Partitioning , Graph Sparsification , and Solving Linear Systems preliminary draft
We develop nearly-linear time algorithms for approximately solving sparse symmetric diagonally-dominant linear systems. In particular, we present a linear-system solver that, given an n-by-n symmetric diagonally-dominant matrix A with m non-zero entries and an n-vector b, produces a vector x̃ within relative distance ǫ of the solution to Ax = b in time m ( log n+ log(nκf (A)/ǫ) ) +min ( m,n log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1408.1693 شماره
صفحات -
تاریخ انتشار 2014